Triggering method for instant search

ABSTRACT

Techniques are provided for automatically determining when to trigger instant search. In one technique, while a user is entering text to formulate a search query, and prior to receiving an indication that the user has completed formulation of the search query, a search assistant system determines the most popular queries that include the text the user has already entered. The search assistant system then determines whether to proactively provide, to the user, search results for the top-candidate of those completed queries. That determination may take into account factors such as whether the top-candidate qualifies as a dominant completed query, a richness metric determined for the search results for the particular completed query, and/or a satisfaction metric determined for the search results for the particular completed query. If the search assistant system determines to proactively provide search results for the particular completed query, the search results for the particular completed query are presented to the user prior to receiving any indication that the user has completed formulation of the search query.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent applicationSer. No. 14/720,867 filed May 25, 2015, which is incorporated herein inits entirety.

FIELD OF THE INVENTION

The present invention relates to instant search and, more specifically,to techniques relating to when to begin providing instant search resultsto users as the users are formulating their search queries.

BACKGROUND

The amount of information that is currently available to search enginesis enormous. Given the quantity of information available, it is criticalto provide users tools that make finding the right information as quickand easy as possible. Consequently, many techniques have been developedfor improving the speed and quality of the searching experience.

One such technique for making the search experience faster and easier isreferred to as “instant search”. In the context of search assistantsystems, “instant search” refers to the technique of showing a searchresult page to a user even before the user completes entering the searchquery in a search box.

The usefulness of instant search hinges greatly on whether the searchassistant system starts to provide search result pages too early or toolate in the user's query formulation. Specifically, if instant searchdoes not start providing search result pages until the user has nearlyfinished formulating the user's entire search query, then instant searchdoes not save the user much time or effort. On the other hand, providingsearch result pages too early and too often in the query formulationprocess consumes screen space, consumes client-side processing power,and is distracting or annoying, without providing any significantbenefit. The too-early search result pages provide little benefitbecause the too-early pages are unlikely to contain results that relateto the searcher's actual interests.

Thus, it is desirable to provide techniques for initiating instantsearch as soon as, but not before, the search results are likely to beof interest to the user of the search assistant system.

The approaches described in this section are approaches that could bepursued, but not necessarily approaches that have been previouslyconceived or pursued. Therefore, unless otherwise indicated, it shouldnot be assumed that any of the approaches described in this sectionqualify as prior art merely by virtue of their inclusion in thissection.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings:

FIG. 1 is a block diagram of a web page that includes (a) a search boxcontaining an incomplete search query and (b) instant search resultsthat are based on the incomplete search query in the search box,according to one embodiment;

FIG. 2 is a block diagram of a system for use in determining when totrigger the use of instant search, according to one embodiment;

FIG. 3 is a flowchart illustrating steps for determining whether totrigger instant search, according to one embodiment; and

FIG. 4 is a block diagram of a computer system that may be used toimplement the techniques described herein.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of the present invention. It will be apparent, however,that the present invention may be practiced without these specificdetails. In other instances, well-known structures and devices are shownin block diagram form in order to avoid unnecessarily obscuring thepresent invention.

General Overview

Techniques for determining when to trigger instant search are describedherein. As used herein, the term “trigger” refers to causing the searchassistant system to transition from a state in which the searchassistant system does not provide instant search results, to a state inwhich the search assistant system provides instant search results. Asexplained above, triggering instant search too early wastes computingresources and impairs the user's search experience, while triggeringinstant search too late reduces the benefit of instant search.

According to one embodiment, a search assistant system first predictsthe intent of a user that is formulating a query based on user input ina search box. For example, the search assistant system may predict theuser's search intent every time a user enters a keystroke into a searchbox. The prediction may involve identifying, based on what the user hastyped in the search box so far, the queries that have the highestlikelihood to match the user's search intent. For example, asillustrated in FIG. 1, if the uncompleted query 102 is “hello”, thesearch assistant system may predict that the completed query is likelyto be one of “hello kitty”, “hello magazine”, “hello kitty games” and“hello kitty coloring pages”.

The queries that are determined to have the highest likelihood to matchthe user's intent are referred to herein as the“completed-query-candidates”. The completed-query-candidates for a givenuncompleted query are collectively referred to as the“completed-query-set” of the uncompleted query. In the exampleillustrated in FIG. 1, the completed-query-set 104 for the uncompletedquery 102 “hello” includes “hello kitty”, “hello magazine”, “hello kittygames” and “hello kitty coloring pages”.

According to one embodiment, the search assistant system ranks thecompleted-query-candidates based on the likelihood that they representthe user's search intent. The completed-query-candidate that has thehighest likelihood of representing the user's search intent is referredto herein as the “top-candidate”. In the example illustrated in FIG. 1,“hello kitty” is the top-candidate 106 for the uncompleted query 102“hello”.

According to one embodiment, once the completed-query-set and thetop-candidate for the uncompleted query is determined, the searchassistant system then determines whether to trigger instant search basedon whether the top-candidate is likely to produce high quality searchresults. The determination of whether the top-candidate is likely toproduce high quality search results may be based on a variety offactors, including but not limited to (a) whether the top-candidatequalifies as a dominant completed query, (b) a richness metricdetermined for the search results for the top-candidate; and/or (c) asatisfaction metric determined for the search results for thetop-candidate. Each of these factors shall be described in greaterdetail hereafter.

If the search assistant system determines that the top-candidate is notlikely to produce high quality search results, then the search assistantsystem refrains from providing instant search results to the user. Inresponse to determining that the top-candidate is likely to provide highquality search results, the search assistant system provides to the usera high quality search result page instantly, without waiting for theuser to complete the search query, and without overloading the back-endsearch engine(s).

Search Assistant Functional Overview

Referring to FIG. 2, it is a block diagram of a search assistant system200 according to one embodiment. In the illustrated embodiment, inaddition to providing an auto-completion feature based on user partialinput in a search box, search assistant system 200 further enhances thesearch experience by integrating the feature of instant search. However,rather than invoke the instant search feature at every keystroke of theuser, search assistant system 200 is configured to trigger instantsearch only when the benefits provided by instant search are determinedto outweigh the overhead consumed by instant search. Specifically,according to one embodiment, search assistant system 200 is configuredto determine when to trigger instant search using the techniqueillustrated in the flowchart of FIG. 3.

Referring to FIG. 3, at step 302, search assistant system 200auto-completes the user query, which is typically partial andincomplete, by identifying the completed-query-set for the uncompleteduser query. At step 304, search assistant system 200 determines whetherthe top-candidate in the completed-query-set is “dominant”. According toone embodiment, the top-candidate qualifies as dominant if theprobability that the user that is formulating the search query intendsto issue the top-candidate exceeds a certain threshold.

If search assistant system 200 determines that the top-candidate in thecompleted-query-set is dominant, then control passes to step 308. Ifsearch assistant system 200 determines that the top-candidate in thecompleted-query-set is not dominant, then control passes to step 306,where the search assistant system 200 awaits the user's next keystroke.At the user's next keystroke, control passes from step 306 back to step302.

At step 308, the search assistant system 200 determines whether thesearch result page that would be produced by the top candidate meets arichness threshold. If the search result page that would be produced bythe top candidate meets a richness threshold, then control passes tostep 312 where instant search is triggered. The triggering of instantsearch causes search results based on the top-candidate to be sent tothe user. After providing the instant search results, control passesback to step 306.

If, at step 308, the search result page that would be produced by thetop-candidate does not meet the richness threshold, then control passesto step 310. At step 310 it is determined whether the search result pageof the top-candidate meets a satisfaction threshold. If the searchresult page that would be produced by the top candidate would meet thesatisfaction threshold, then control passes to step 312 where instantsearch is triggered. As explained above, the triggering of instantsearch causes search results based on the top-candidate to be instantlysent to the user. After providing the instant search results, controlpasses back to step 306.

If, at step 310, the search result page that would be produced by thetop-candidate does not meet the satisfaction threshold, then controlpasses to step 306 where search assistant system 200 awaits the nextkeystroke without triggering instant search. Thus, in the embodimentillustrated in FIG. 3, instant search is triggered if and only if(top-candidate is dominant) and either (richness threshold satisfied) or(satisfaction threshold satisfied).

The embodiment illustrated in FIG. 3 is merely one of several wayscandidate dominance, predicted richness and predicted satisfaction maybe used as factors in determining whether to trigger instant search. Thetechniques described herein are not limited to any particular formulathat uses these factors. For example, in alternative embodiments,instant search may be triggered if and only if all three factors(dominance, richness and satisfaction) are satisfied. In yet anotheralternative, instant search may be triggered if any one of the threefactors is satisfied. Examples of how each of these three factors may bedetermined are given in greater detail hereafter.

Dynamically Varying Trigger Conditions

According to one embodiment, the factors that must be satisfied totrigger instant search, and/or the thresholds used by the factors, varydynamically over time. The variables that cause the trigger conditionsto change may include, for example, environmental factors such as thetime of day, the current load on the search engines, etc.

For example, in one embodiment: when the current load on the searchengines is low, satisfying any one of the three factors (dominance,richness and satisfaction) triggers instant search. On the other hand,when the current load on the search engines is high, all three factorshave to be satisfied in to trigger instant search.

In yet another embodiment, the factors that need to be satisfied totrigger instant search do not change, but the thresholds do. Forexample, when the current load on the search engines is low, thethresholds for satisfying “dominance”, “richness” and/or “satisfaction”may be relatively low. On the other hand, when the current load on thesearch engines is high, the thresholds for satisfying “dominance”,“richness” and/or “satisfaction” are relatively high.

Determining Whether the Dominance Factor is Satisfied

Referring again to FIG. 2, search assistant system 200 includes a userand query database 202 (hereafter “U&Q database 202”). According to oneembodiment, U&Q database 202 contains information about query and userbehavior. For example, for each query, U&Q database 202 has records thatindicate when, where and how many users have issued the query inquestion.

Search assistant system 200 also includes triggering module 204.Triggering module 204 examines the queries in the completed-query-set(provided by candidate selection and ranking module 206) and determinesif the top-candidate is “dominant” based on the information contained inU&Q database 202.

For example, as illustrated in FIG. 1, a user's query “hello” has fourcompleted-query-candidates. Based on the information contained in U&Qdatabase 202, triggering module 204 may determine that intentprobabilities for each of those four follows:

hello kitty 0.65

hello magazine 0.26

hello kitty games 0.07

hello kitty coloring pages 0.02

Based on the information in U&Q database 202, the triggering module 204can also determine that the top-candidate “hello kitty”, is the mostwanted query for the user's partial input “hello”. By comparing theintent probability of “hello kitty” with the intent probability of theother completed-query-candidates, triggering module 204 may determinethat “hello kitty” is dominant (“hello kitty's” intent probability of0.65 is much higher than those of the other completed-query-candidates).Based on this determination, the search assist system 200 auto-completesthe query “hello” as “hello kitty” and may instantly load and show thesearch result page for “hello kitty”.

As another example, assume that the user's partial query is “test”. Thecompleted-query-set for “test” may include fourcompleted-query-candidates: “test”, “testosterone”, “testosteronesupplements” and “test internet speed”. Based on the information fromU&Q database 202, triggering module 204 may determine the intentprobabilities to be:

test 0.33

testosterone 0.31

testosterone supplements 0.24

test internet speed 0.12

Clearly, the search intent of the top-candidate “test” is not dominant,as its intent probability 0.33 is more or less the same as that ofsecond completed-query-candidate.

The User and Query Database

As mentioned above, triggering module 204 determines whether atop-candidate is dominant based on information from U&Q database 202.According to one embodiment, U&Q database 202 includes several featureswhich help triggering module 204 calculate the intent probabilitiesamong the completed-query-candidates and determine whether the instantsearch should be triggered. For example, U&Q database 202 may includeinformation about:

-   -   query frequency per time/location info, which is mined from user        search logs, and is aggregated in certain time period, for        example, 30 or 90 days, and    -   Individual user search history & query patterns

The U&Q database 202 may include information such as the time each querywas submitted, the location from which each query was submitted, and theuser that submitted the query. Consequently, whether a particulartop-candidate for a particular uncompleted query is dominant may changebased on the time, location or type of user. In FIG. 2, the time, usercharacteristics and location information for a particular uncompletedquery are provided by user device 216. However, in alternativeembodiment, this information may come from an intermediary server withwhich user device 216 is interacting.

As an example of how time, location, or user type can affect thedominance determination made by triggering module 204, assume that theuncompleted query is “hello” and the user is male. Under thesecircumstances, based on the information contained in U&Q database 202about queries submitted by males, “hello kitty” may not be dominant forthe query “hello”. On the other hand, based on the information containedin U&Q database 202 about queries submitted by females, “hello kitty”may be dominant for the query “hello”.

As yet another example, “hello kitty” may be dominant for “hello”queries formulated between 3 pm and 6 pm, but not dominant for “hello”queries formulated at other times in the day. Similarly, “hello kitty”may be dominant for “hello” queries that originate in Arizona, but notdominant for “hello” queries that originate in New York. As illustratedin these examples, the dominance determination may be based on queryfrequencies that only take into account queries that were submitted at aparticular time, by a particular type of user, and/or from a particularlocation or type of location (e.g. city vs rural).

Further, it is possible that the top-candidate itself changes based ontime, location, or type of user. For example, the top-candidate for “c”may be “coffee” in the morning, but something else at night. Similarly,the top-candidate for “new” may be “New York Times” for queries thatoriginated in New York, but something else for queries that originatedin California. In addition, gender is merely one example of a userattribute that may be used to filter the queries for the purposes ofdetermining top-candidate and dominance. Virtually any information knowabout users may be used, including but not limited to age, hobbies,individual search history, user group memberships, etc.

As an example of how information stored in the U&Q database 202 may beused, assume that a user's partial input or prefix is ‘tom’. Based onthis partial input, the candidate selection and ranking module 206 mayprovide triggering module 204 the top N (e.g., 4)completed-query-candidates as follows:

tom brady

tom cruise

tom and jerry

tom selleck

Upon receiving these completed-query-candidates, the triggering module204 calculates the approximate intent probability of eachcompleted-query-candidate and determines if top-candidate, “tom brady”in the above example, dominates other completed-query-candidates.

For the purpose illustration, assume that the information within U&Qdatabase 202 indicates that of 100 people that type ‘tom’, 60 peoplewould search for “tom brady” and 20 people would seek ‘tom cruise’.Based on this, the intent probability of the firstcompleted-query-candidate, “tom brady”, can be computed as 60/100=0.6.If a threshold (e.g., 0.6) is further specified to define the dominantintent, then completed-query-candidate “tom brady” can be considered asthe dominant intent for query “tom” as its probability 0.6 exceeds orequals to the threshold. As a result, the instant search is triggeredwith “tom brady” as search query, and it would match the intent ofmajority of people. On the other hand, if the threshold is 0.68, thenthe first completed-query-candidate is no longer dominant and thereforeinstant search will not be triggered.

Dynamically Varying Threshold for Determining Dominance

In the examples given above, the threshold for determining whether thetop-candidate was dominate was constant (either 0.6 or 0.68). However,the probability threshold does not need to be a constant. For example,in alternative embodiments, the threshold used to determine dominancecan be a function of prefix length and/or number ofcompleted-query-candidates available. For example, the threshold fordominant intent could be defined as:dominant-intent-threshold=alpha*query-length+beta

where, “query-length” is the length (in number of characters) of theuser's partial query, and alpha and beta are constants that can bedetermined based on information from user search log. Generallyspeaking, when the length of user's query is short, the user's intent isvague and diverse. In order for a completed-query-candidate to bedominant, the threshold should be high. On the contrary, when the lengthof user's query is long, the user's intent is more obvious and narrow.Therefore, when the length of the user's query is long, a lowerthreshold can be used to determine the dominant intent. Based on thisobservation, an embodiment can, for example, establish that thethreshold for query length 2 is 0.65 while the threshold is 0.41 forquery length 62. Under these circumstances, the alpha and beta can bederived as:alpha=(0.65−0.41)/(2−62)=−0.004,beta=(0.65+2*0.004)=0.658

Therefore, the relationship between dominant intent threshold and querylength can be expressed as:dominant-intent-threshold=−0.004*query-length+0.658

Based on this formula, the threshold should be 0.646 when the length ofuser's partial query is 3. Consequently, search assist will not triggerinstant search for query “tom” because the intent of its firstcompleted-query-candidate “tom brady” is not dominant (0.6<0.646). Inthe same manner, the threshold becomes 0.638 when the length of user'squery is 5. Thus, for query “hello”, which is 5 in length, the searchassistant will trigger instant search as the intent probability of itsfirst completed-query-candidate “hello kitty” is dominant (i.e.,0.65>0.638).

According to one embodiment, there is a minimum threshold below whichthe dominant-intent-threshold is not permitted to go. For example,assume that the minimum threshold is 0.4. Under these circumstances, ifthe user's query becomes so long that the dominant-intent-thresholdwould fall below 0.4, then 0.4 is used as the dominant-intent-threshold.

In addition to query length, the threshold for dominant intent can bedefined to depend on number of completed-query-candidates as well. Inone embodiment, this is accomplished by deriving different alpha andbeta values based on the number of available completed-query-candidates.It is evident that the smaller the number of availablecompleted-query-candidates is, the easier it is for the top-candidate tobe dominant. Thus, it is reasonable to set the threshold for dominantintent higher when there are less available completed-query-candidates.One possible way, for example, to define threshold based on both querylength and number of completed-query-candidates could be:dominant-intent-threshold=−0.004*query-length+0.658 when number ofcompleted-query-candidate>=4−0.004*query-length+0.708 when number of completed-query-candidate=3−0.004*query-length+0.758 when number of completed-query-candidate=2

Determining Intent Probability

As explained above, dominance is determined by comparing thetop-candidate's intent probability against a dominant-intent-threshold.As also explained above, the triggering module 204 may determine thetop-candidate's intent probability based on information from U&Qdatabase 202. According to one embodiment, a users' intent, given aprefix, can be calculated by query frequency:ip(x)=freq(x)/Σfreq(i),(i=1, . . . ,N and N is the number ofcompleted-query-candidates)

For example, if query frequency of “tom brady” is 60, “tom cruise” is20, and “tom and jerry” is 10 and “tom selleck” is 10 in U&Q database202, the intent probability for “tom brady” given a prefix “tom” is 0.6by using the above formula.

In an alternative embodiment, triggering module 204 can put more weighton the recent query frequency when calculating intent probability. Forexample:popularity-of-query=a*count_in_the_last_week+b*whole_countfor example a=100, and b=1intent probability=popularity-of-query(x)/Σpopularity-of-query(i),(i=1,. . . ,N)

The Richness Metric

As mentioned above, “richness” may be a factor used by triggering module204 to determine whether to trigger instant search. In the context ofsearch assistant system 200, “richness” is a measure of thequality/diversity of content contained in the search results that wouldbe produced by the top-candidate. Those search results are referred toherein as “top-candidate-search-results” or TCSR. According to oneembodiment, triggering module 204 determines the richness of the TCSRbased on information obtained from search result page quality database208 (hereafter “SRPQ database 208”).

According to one embodiment, SRPQ database 208 contains informationabout the search result pages produced by queries. For example, theinformation from SRPQ database 208 indicates whether a search resultpage contains a Knowledge Graph, Direct Displays of video or image, ornews etc., and their positions. The information in SRPQ database 208 isregularly mined and aggregated from user search logs and integratedperiodically into the instant search system described in this invention.In summary, the information contained in SRPQ database 208 helps thetriggering module 204 determine whether the TCSR is high quality searchresult page, and therefore worthy of showing instantly to the user.

For example, as illustrated in FIG. 1, the search result page of thetop-candidate “hello kitty” for the partial query “hello” contains imageDirect Display and information about the Sanrio site—the official siteof hello kitty and friends. Clearly, the search result page has rich andauthoritative information. Based on this information, triggering module204 may assign the TCSR a high richness metric, and therefore decide toload the TCSR instantly when user's input is “hello”.

The Satisfaction Metric

Instead of or in addition to the richness metric, triggering module 204may use a satisfaction metric to determine whether the TCSR is ofsufficient quality to trigger instant search. The satisfaction metric isa measure of the likelihood that the user will find the TCSR to beuseful. The satisfaction metric may be calculated, for example, on howoften prior users have found the contents of the TCSR to be useful, asevidenced, for example, by how frequently users have clicked any ofthose contents. In one embodiment, triggering module 204 obtainshistorical click information from U&Q database 202.

In addition to the click-through information for the TCSR, usersatisfaction may also take into account algorithmic results thatindicate high satisfaction, such as the average “dwell time” users havespent when presented with the TCSR, etc.

The Search Result Page Quality Database

According to an embodiment, SRPQ database 208 includes several featuresused by triggering module 204 to determine both the richness metric andthe satisfaction metric. For example, as explained above, SRPQ database208 may include information that indicates whether the TCSR containsrich information such as Knowledge Graph, or Direct Display of video,image, or news etc. In one embodiment, SRPQ database 208 maintains thisinformation per query, and aggregated by certain period, for example,last 30 or 90 days.

With respect to clicks, U&Q database 202 may indicate whether the TCSRhas a good click-through-rate (“CTR”). Database may include severaltypes of CTR statistic for any given TCSR, such as overall CTR, CTR onthe first algorithmic result, CTR on Direct Display, CTR on ads, etc. Inone embodiment, this CTR information is recorded for each query, andaggregated by certain period.

The Triggering Module

As explained above, triggering module 204 determines whether to triggerinstant search based on both intent probability (dominance) and searchresult page quality (richness and satisfaction) features. Triggeringmodule 204 itself may be implemented in a variety of ways, including anembodiment in which triggering module 204 is implemented as a rule-basedtriggering function, and another embodiment in which triggering module204 uses a machine learning model to determine whether to triggerinstant search. In yet another embodiment, triggering module 204 mayinclude a combination of both rule-based and machine-learned modeltriggering mechanisms.

With respect to an embodiment that uses a rule-based triggeringmechanism, rules can be defined based on dominant intent and richness ofinformation in search result page. For example, a simple rule basedtriggering mechanism for instant search can be set up as: Triggerinstant search if and only if:

-   -   user intent of top-candidate for the user query is dominant        (that is, intent probability of top-candidate>=threshold) AND        EITHER    -   richness of information in TCSR is high (i.e., total number of        direct displays, knowledge graph, answers, quick links, or        number of ads is larger than a threshold), OR    -   user's satisfaction on TCSR is high (e.g., average page dwell        time and click through rate is higher than given thresholds)

This rule may be implemented corresponds to the flowchart of FIG. 3,described above.

In embodiments where triggering module 204 makes the triggering decisionbased on machine-learned models, the models can be built in severalways. For example, a Support Vector Machine (SVM) could be used in thefollowing way to construct a model:

First, a training set is built, which is a collection of judgments inthe form of “partial query, its related completed-query-candidates, alabel to indicate whether or not Instant Search should be triggered”.Each judgment data is then translated into a vector of features, x, thatincludes:

intent probability,

feature values derived from search result page,

a label y (which could be 1 for triggering Instant Search and 0otherwise),

A model is then built on the training data. After model training, thefunction y=f(x, α) is obtained, where α represents the parameters of thefunction. The returned value of the function is mapped into a flag withbinary values (that is, either 0 or 1) to indicate whether instantsearch should be triggered. For explanation purpose, the vector offeatures used in building a SVM model could be:

-   -   vector of features=(length of query, length of first        completed-query-candidate, highest intent probability, lowest        intent probability, existence of knowledge graph on search        result page, number of direct displays at top, number of direct        displays at right, number of direct displays at middle, quick        links, number of search results in search result page, click        through rate on search result page, average dwell time on search        result page, number of ads at top, number of ads at right, . . .        )

Using this vector of features and Hence, the vector of features forquery “hello” and its label would look like:

(5, 11, 0.65, 0.02, 0, 6, 0, 0, 1, 10, 0.5, 10.0, 0, 0, . . . )=>yes fortriggering instant search.

Similarly, the vector of features for query “test’ and its label wouldlook like:

(4, 4, 0.33, 0.12, 0, 0, 0, 0, 0, 10, 0.1, 5.0, 0, 0, . . . )=>no fortriggering instant search.

According to one embodiment, the rule-based triggering mechanism andmachine-learned model based triggering mechanism are integratedtogether. For example, in such an embodiment, instant search will betriggered if either the rule based mechanism or machine learned modelindicates that it is good to present the TCSR to the user.

User Monitoring and Data Acquisition

As explained above, triggering module 204 makes the decision of whetherto trigger instant search based on search result page qualityinformation obtained from SRPQ database 208, and user and queryinformation obtained from U&Q database 202. For this to happen, SRPQdatabase 208 and U&Q database 202 have to be populated with thenecessary information. Populating U&Q database 202 and SRPQ database 208with information, and keeping that information up to date, may beaccomplished by continuously monitoring user behavior to obtaininformation such as click through rate, and dwell time on search resultpages. In the search assistant system 200 illustrated in FIG. 2, a datamining and aggregation module 210 is responsible for mining data fromuser search logs 212, performing any desired aggregation on the data,and storing the data into U&Q database 202 and SRPQ database 208.

In addition to obtaining information such as click through rates anddwell time, data mining and aggregation module also determines from theuser search log 212 which queries are being issued by users. Theinformation obtained about the queries that are being issued by users isstored in suggestion database 214, and used by candidate selection andranking module 206 to determine the candidate-query-set for any givenuncompleted query. As has been described above, the information providedby candidate selection and ranking module 206 is used by triggeringmodule to determine the top-candidate, and to determine whether thetop-candidate is dominant.

Hardware Overview

According to one embodiment, the techniques described herein areimplemented by one or more special-purpose computing devices. Thespecial-purpose computing devices may be hard-wired to perform thetechniques, or may include digital electronic devices such as one ormore application-specific integrated circuits (ASICs) or fieldprogrammable gate arrays (FPGAs) that are persistently programmed toperform the techniques, or may include one or more general purposehardware processors programmed to perform the techniques pursuant toprogram instructions in firmware, memory, other storage, or acombination. Such special-purpose computing devices may also combinecustom hard-wired logic, ASICs, or FPGAs with custom programming toaccomplish the techniques. The special-purpose computing devices may bedesktop computer systems, portable computer systems, handheld devices,networking devices or any other device that incorporates hard-wiredand/or program logic to implement the techniques.

For example, FIG. 4 is a block diagram that illustrates a computersystem 400 upon which an embodiment of the invention may be implemented.Computer system 400 includes a bus 402 or other communication mechanismfor communicating information, and a hardware processor 404 coupled withbus 402 for processing information. Hardware processor 404 may be, forexample, a general purpose microprocessor.

Computer system 400 also includes a main memory 406, such as a randomaccess memory (RAM) or other dynamic storage device, coupled to bus 402for storing information and instructions to be executed by processor404. Main memory 406 also may be used for storing temporary variables orother intermediate information during execution of instructions to beexecuted by processor 404. Such instructions, when stored innon-transitory storage media accessible to processor 404, rendercomputer system 400 into a special-purpose machine that is customized toperform the operations specified in the instructions.

Computer system 400 further includes a read only memory (ROM) 408 orother static storage device coupled to bus 402 for storing staticinformation and instructions for processor 404. A storage device 410,such as a magnetic disk or optical disk, is provided and coupled to bus402 for storing information and instructions.

Computer system 400 may be coupled via bus 402 to a display 412, such asa cathode ray tube (CRT), for displaying information to a computer user.An input device 414, including alphanumeric and other keys, is coupledto bus 402 for communicating information and command selections toprocessor 404. Another type of user input device is cursor control 416,such as a mouse, a trackball, or cursor direction keys for communicatingdirection information and command selections to processor 404 and forcontrolling cursor movement on display 412. This input device typicallyhas two degrees of freedom in two axes, a first axis (e.g., x) and asecond axis (e.g., y), that allows the device to specify positions in aplane.

Computer system 400 may implement the techniques described herein usingcustomized hard-wired logic, one or more ASICs or FPGAs, firmware and/orprogram logic which in combination with the computer system causes orprograms computer system 400 to be a special-purpose machine. Accordingto one embodiment, the techniques herein are performed by computersystem 400 in response to processor 404 executing one or more sequencesof one or more instructions contained in main memory 406. Suchinstructions may be read into main memory 406 from another storagemedium, such as storage device 410. Execution of the sequences ofinstructions contained in main memory 406 causes processor 404 toperform the process steps described herein. In alternative embodiments,hard-wired circuitry may be used in place of or in combination withsoftware instructions.

The term “storage media” as used herein refers to any non-transitorymedia that store data and/or instructions that cause a machine tooperation in a specific fashion. Such storage media may comprisenon-volatile media and/or volatile media. Non-volatile media includes,for example, optical or magnetic disks, such as storage device 410.Volatile media includes dynamic memory, such as main memory 406. Commonforms of storage media include, for example, a floppy disk, a flexibledisk, hard disk, solid state drive, magnetic tape, or any other magneticdata storage medium, a CD-ROM, any other optical data storage medium,any physical medium with patterns of holes, a RAM, a PROM, and EPROM, aFLASH-EPROM, NVRAM, any other memory chip or cartridge.

Storage media is distinct from but may be used in conjunction withtransmission media. Transmission media participates in transferringinformation between storage media. For example, transmission mediaincludes coaxial cables, copper wire and fiber optics, including thewires that comprise bus 402. Transmission media can also take the formof acoustic or light waves, such as those generated during radio-waveand infra-red data communications.

Various forms of media may be involved in carrying one or more sequencesof one or more instructions to processor 404 for execution. For example,the instructions may initially be carried on a magnetic disk or solidstate drive of a remote computer. The remote computer can load theinstructions into its dynamic memory and send the instructions over atelephone line using a modem. A modem local to computer system 400 canreceive the data on the telephone line and use an infra-red transmitterto convert the data to an infra-red signal. An infra-red detector canreceive the data carried in the infra-red signal and appropriatecircuitry can place the data on bus 402. Bus 402 carries the data tomain memory 406, from which processor 404 retrieves and executes theinstructions. The instructions received by main memory 406 mayoptionally be stored on storage device 410 either before or afterexecution by processor 404.

Computer system 400 also includes a communication interface 418 coupledto bus 402. Communication interface 418 provides a two-way datacommunication coupling to a network link 420 that is connected to alocal network 422. For example, communication interface 418 may be anintegrated services digital network (ISDN) card, cable modem, satellitemodem, or a modem to provide a data communication connection to acorresponding type of telephone line. As another example, communicationinterface 418 may be a local area network (LAN) card to provide a datacommunication connection to a compatible LAN. Wireless links may also beimplemented. In any such implementation, communication interface 418sends and receives electrical, electromagnetic or optical signals thatcarry digital data streams representing various types of information.

Network link 420 typically provides data communication through one ormore networks to other data devices. For example, network link 420 mayprovide a connection through local network 422 to a host computer 424 orto data equipment operated by an Internet Service Provider (ISP) 426.ISP 426 in turn provides data communication services through the worldwide packet data communication network now commonly referred to as the“Internet” 428. Local network 422 and Internet 428 both use electrical,electromagnetic or optical signals that carry digital data streams. Thesignals through the various networks and the signals on network link 420and through communication interface 418, which carry the digital data toand from computer system 400, are example forms of transmission media.

Computer system 400 can send messages and receive data, includingprogram code, through the network(s), network link 420 and communicationinterface 418. In the Internet example, a server 430 might transmit arequested code for an application program through Internet 428, ISP 426,local network 422 and communication interface 418.

The received code may be executed by processor 404 as it is received,and/or stored in storage device 410, or other non-volatile storage forlater execution.

In the foregoing specification, embodiments of the invention have beendescribed with reference to numerous specific details that may vary fromimplementation to implementation. The specification and drawings are,accordingly, to be regarded in an illustrative rather than a restrictivesense. The sole and exclusive indicator of the scope of the invention,and what is intended by the applicants to be the scope of the invention,is the literal and equivalent scope of the set of claims that issue fromthis application, in the specific form in which such claims issue,including any subsequent correction.

What is claimed is:
 1. A method implemented on a machine having at leastone processor, storage, and a communication platform connected to anetwork for providing search results, the method comprising: receiving aportion of a query from a user; obtaining, based on a first criterion, aplurality of complete queries, each of which includes the portion of thequery; determining whether one of the plurality of complete searchqueries satisfies a second criterion; in response to at least one of theplurality of complete search queries satisfying the second criterionpresenting, prior to the query being completed by the user, searchresults obtained based on the one of the plurality of complete searchqueries; and in response to the plurality of complete search queriesviolating the second criterion waiting for further input about the queryfrom the user.
 2. The method of claim 1, wherein the first criterioncorresponds to one of a time at which the user issues the portion of thequery, a location of the user, and characteristics of the user.
 3. Themethod of claim 1, wherein the second criterion corresponds to the oneof the plurality of complete search queries having an intent valuegreater than an intent threshold.
 4. The method of claim 3, wherein theintent threshold varies with respect to one of time, and a load in asearch engine.
 5. The method of claim 3, wherein the intent threshold isdetermined based on at least one of a length of the portion of thequery, and a number of complete queries included in the plurality ofcomplete search queries.
 6. The method of claim 1, wherein the secondcriterion corresponds to a richness metric associated with the searchresults obtained for the one of the plurality of complete search queriesexceeding a predetermined richness threshold.
 7. The method of claim 6,wherein the richness metric is based on a type of content included inthe search results for the one of the plurality of complete searchqueries.
 8. The method of claim 1, wherein the second criterioncorresponds to a satisfaction metric associated with the search resultsobtained for the one of the plurality of complete search queriesexceeding a predetermined satisfaction threshold.
 9. The method of claim8, wherein the satisfaction metric associated with the search results isdetermined based on a frequency of previous user's interaction with thesearch results.
 10. A non-transitory machine-readable medium havinginformation recorded thereon for providing search results, wherein theinformation, when read by the machine, causes the machine to performoperations comprising: receiving a portion of a query from a user;obtaining, based on a first criterion, a plurality of complete queries,each of which includes the portion of the query; determining whether oneof the plurality of complete search queries satisfies a secondcriterion; in response to at least one of the plurality of completesearch queries satisfying the second criterion presenting, prior to thequery being completed by the user, search results obtained based on theone of the plurality of complete search queries; and in response to theplurality of complete search queries violating the second criterionwaiting for further input about the query from the user.
 11. The mediumof claim 10, wherein the first criterion corresponds to one of a time atwhich the user issues the portion of the query, a location of the user,and characteristics of the user.
 12. The medium of claim 10, wherein thesecond criterion corresponds to the one of the plurality of completesearch queries having an intent value greater than an intent threshold.13. The medium of claim 12, wherein the intent threshold varies withrespect to one of time, and a load in a search engine.
 14. The medium ofclaim 12, wherein the intent threshold is determined based on at leastone of a length of the portion of the query, and a number of completequeries included in the plurality of complete search queries.
 15. Themedium of claim 10, wherein the second criterion corresponds to arichness metric associated with the search results obtained for the oneof the plurality of complete search queries exceeding a predeterminedrichness threshold.
 16. The medium of claim 15, wherein the richnessmetric is based on a type of content included in the search results forthe one of the plurality of complete search queries.
 17. The medium ofclaim 10, wherein the second criterion corresponds to a satisfactionmetric associated with the search results obtained for the one of theplurality of complete search queries exceeding a predeterminedsatisfaction threshold.
 18. The medium of claim 17, wherein thesatisfaction metric associated with the search results is determinedbased on a frequency of previous user's interaction with the searchresults.
 19. A system having at least one processor, storage, and acommunication platform for providing search results, the systemcomprising: a candidate selection unit implemented by the at least oneprocessor and configured to: receive a portion of a query from a user,and obtain, based on a first criterion, a plurality of complete queries,each of which includes the portion of the query; and a triggering unitimplemented by the at least one processor and configured to: determinewhether one of the plurality of complete search queries satisfies asecond criterion, in response to at least one of the plurality ofcomplete search queries satisfying the second criterion present, priorto the query being completed by the user, search results obtained basedon the one of the plurality of complete search queries, and in responseto the plurality of complete search queries violating the secondcriterion wait for further input about the query from the user.
 20. Thesystem of claim 19, wherein the second criterion corresponds to the oneof the plurality of complete search queries having an intent valuegreater than an intent threshold.